Hash Function for Triangular Mesh Reconstruction
نویسندگان
چکیده
Some applications use data formats (for example STL file format), where a set of triangles is used to represent a surface of an object and it is necessary to reconstruct the regular triangular mesh from such a data format for many applications. It is a lengthy process for large data sets as the time complexity of this process is O(N) or O(N lgN), where N is a number of triangles. Hash data structures are widely used all over the fields of computer science. The hash table can be used to speed up the process of triangular mesh reconstruction but the speed strongly depends on hash function properties. Nevertheless the design or selection of the hash function for data sets with unknown properties is a problem. This paper describes a new hash function and presents properties obtained from large data sets. Key-words: computer graphics, triangular mesh reconstruction, hash function
منابع مشابه
Hash Function for Geometry Reconstruction in Rapid Prototyping
There are many applications where data structures use a hash function. The hash data structures are widely used across all fields of computer science. Nevertheless the design or selection of hash function for data sets with unknown properties is a problem. The Rapid Prototyping uses STL format, where a set of triangles is used to represent a surface of the object. It is necessary to construct t...
متن کاملA General Algorithm for Triangular Meshes Simplification
This article introduces the algorithm for simplification of 2D and 3D triangular meshes. The algorithm evaluates and removes vertices. A hash table is used to speed up the process of selecting the appropriate vertex for its removal. Therefore, this part of the algorithm is executed in constant time O(1). In spite of simplification, triangular mesh models still keep majority of their own essenti...
متن کاملModified half-edge data structure and its applications to 3D mesh generation for complex tube networks
.................................................................. IV TABLE OF CONTENTS........................................................... V LIST OF FIGURES........................................................... VII LIST OF TABLES........................................................... VIII LIST OF ALGORITHMS......................................................... IX I. INTRODU...
متن کاملA Unified Approach for Textual and Geometrical Information Retrieval
Textual and geometrical algorithms have been considered as two separate fields. This was caused by the fact that textual data are discrete in principal and interpolation is not defined as there is no metric in general, while geometrical data are considered discrete samples of continuous phenomena, geometrical surface etc. In this paper we present a unified approach to textual and geometrical da...
متن کاملOptimizing a Triangular Mesh for Shape Reconstruction from Images
In reconstructing 3-D from images based on feature points, one usually defines a triangular mesh that has these feature points as vertices and displays the scene as a polyhedron. If the scene itself is a polyhedron, however, some of the displayed edges may be inconsistent with the true shape. This paper presents a new technique for automatically eliminating such inconsistencies by using a speci...
متن کامل